Average length of the longest k-alternating subsequence
نویسندگان
چکیده
منابع مشابه
On the Longest $k$-Alternating Subsequence
We show that the longest k-alternating substring of a random permutation has length asymptotic to 2(n− k)/3.
متن کاملLongest Common Subsequence in k Length Substrings
In this paper we define a new problem, motivated by computational biology, LCSk aiming at finding the maximal number of k length substrings, matching in both input strings while preserving their order of appearance. The traditional LCS definition is a special case of our problem, where k = 1. We provide an algorithm, solving the general case in O(n) time, where n is the length of the input stri...
متن کاملA Probabilistic Approach to the Asymptotics of the Length of the Longest Alternating Subsequence
Let LAn(τ) be the length of the longest alternating subsequence of a uniform random permutation τ ∈ [n]. Classical probabilistic arguments are used to rederive the asymptotic mean, variance and limiting law of LAn (τ). Our methodology is robust enough to tackle similar problems for finite alphabet random words or even Markovian sequences in which case our results are mainly original. A sketch o...
متن کاملFluctuation of the Length of the Longest Common Subsequence
Let X1, . . . , Xn and Y1, . . . , Yn be two independent sequences of i.i.d Bernoulli variables with parameter > 0. Let X designate the string X := X1X2 . . . Xn and let Y := Y1Y2 . . . Yn. Let Ln designate the length of the longest common subsequence (LCS) of X and Y . We prove that for a constant c > 0, VAR[Ln] > cn if > 0 is taken small enough. Hence for small , the order of magnitude of VAR...
متن کاملExpected Length of the Longest Common Subsequence for Large Alphabets
We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield that E [L] /n converges to a constant γk. We prove a conjecture of Sankoff and Mainville from the early 80’s claiming that γk √ k → 2 as k → ∞.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2015
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2015.03.003